Pardeep Bhandari ¹, Manpreet Singh ²

Affiliations
1 Doaba College, Jalandhar, Punjab – 144001, IN
2 Punjabi University, Patiala, Punjab – 147002, IN

Abstract

Objectives: This paper proposes a formal model for network security situational awareness which supplements most of the gaps faced in traditional approaches of network security and provides formal representation and functional prototype of National Social Security Authority (NSSA). Methods/Statistical Analysis: Semantic Web based approach and Resource Description Format (RDF) is used for implementation of the formal model. Besides, a novel capability to increment knowledge base of the system has been devised so that the system may adapt to dynamic network structure as per perception of network administrator. Secondly the ability to perceive a particular situation in a specific manner is to be incorporated in the system by network administrator. This capability empowers the administrator to secure network infrastructure in own fashion in a specific context instead of using a generalized security policy. Findings: We have conducted a number of experiments to measure the performance of our proposed framework on a software simulated environment. We have quantified the performance overheads of our proposed framework for measuring the inference time and response time. All the experimental results have shown that our framework has satisfactory response as far as the performance is concerned and for the better performance, more powerful machines can be used. Application/ Improvement: This approach provides a non database semantic approach which can be used to semantically correlate information, thus providing an affective mental model to deal with complex network situations.

Keywords

Network Security Status - National Social Security Authority (NSSA), Ontology, Semantic Web, Semantic Web Rule Language (SWRL).

Full Text

   

Sunil Kumar ¹, Sumit Mittal ², Manpreet Singh ³

Affiliations
1 Department of Computer Science, Guru Nanak College for Girls, Sri Muktsar Sahib –152026, Punjab, IN
2 Maharishi Markandeshwar Institute of Computer Technology and Business Management, Maharishi Markandeshwar University, Mullana, Ambala – 133203, Haryana, IN
3 Department of Computer Science and Engineering, Maharishi Markandeshwar University, Sadopur, Near Omaxe Flats, Ambala-Chandigarh Highway, Ambala – 133001, Haryana, IN

Abstract

Objectives: To make an extensive survey on various meta-heuristic and hybrid task scheduling along with their classification patterns and to find the scope of improvement in these techniques. Method: This paper carries to the deep study of 99 reputed research papers from Springer, IEEE, Elsevier, Scopus indexed; SCI indexed of well-known renowned journals. These research papers are selected by taking into consideration of relevance to research area. These scheduling algorithms are compared in terms of their performance metrics, environments and results. Findings: This paper described that there are various renowned researchers who have proposed various meta-heuristic task scheduling techniques to achieve the optimum results but after the extensive survey of various scheduling techniques based on genetic, Simulated Annealing (SA), ACO, PSO and hybrid reveals that a lot of dimensions are yet to be explored in terms of datacenter cost, virtual machine migration, energy consumption and Service-Level Agreement etc. Application: It discusses numerous meta-heuristic based task scheduling algorithms with their classification patterns so as to find the gap in the already proposed algorithm and suggest the untouched areas for the further research.

Keywords

Cloud Computing, Distributive Environment, Metaheuristics, NP Hard Problems, Task Scheduling.

Full Text

   

Mandeep Sidhu ¹, Manpreet Singh ¹

Affiliations
1 Departement of ECE, BGIET Sangrur - 148001, Punjab, IN

Abstract

The nodes in wireless sensor networks are usually deployed in the areas where human approach is very difficult. In such cases, the deployment of the nodes tends to be random from topological point of view. The main thing that needs to be given importance in such kind of networks is their lifetime which tends to be very less as the nodes are battery operated nodes. So if any of the sensors dies out because of energy drainage it is very difficult to come up with their replacement. The replacement of the drained out sensor nodes tends to become a costly affair. In such scenarios the focus must be given on reducing the energy consumption of the sensor nodes so that they can transfer the data over a longer period of time. The solution to this is clustering of the nodes in groups based on some rules that would eventually increase their working time in the network. The rules laid out for clustering is usually defined in LEACH protocol that tends to form the clusters and select their leaders randomly using threshold criterion. However, the clustering of the network results should be optimal enough such that all the nodes are included in the cluster. This paper explores the clustering protocol and aims to optimize the clustering process to improve the lifetime of the network. The proposed scheme has shown better performance in terms of energy consumption, packet delivery ratio and throughput.

Keywords

Clustering, Packet Delivery Ratio, Throughput, LEACH

Full Text

   

Munish Mehta ¹, Jujhar Singh ², Manpreet Singh ³

Affiliations
1 I. K. Gujral Punjab Technical University, Kapurthala-144603, Punjab, IN
2 Department of Mechanical Engineering, I. K. Gujral Punjab Technical University, Kapurthala-144603, Punjab, IN
3 Department of Mechanical Engineering, Lovely Professional University, Phagwara-144411, Punjab, IN

Abstract

Objective: To compute the reliability/availability of casting system, a part of steel industry with a view to increase its productivity. Methods/Analysis: The reliability of casting system of a steel industry, consisting of four units, has been computed using Supplementary Variable Technique (SVT) by keeping the failure rates constant and varying the repair rates. From the transition diagram of the casting system, Chapman-Kolmogorov differential equations have been developed using mnemonic rule which are further solved using Lagrange’s method. The transient state availability of the system has been computed by Runge-Kutta fourth order method using MATLAB. Mean Time Between Failures (MTBF) has been calculated numerically. Findings: Besides increasing the plant availability and hence production, the findings of this paper may help in maintenance planning and scheduling of the said system. Novelty/Improvement: Reliability of the casting system of a steel industry has not been discussed so far.

Keywords

Lagrange’s Method, Runge-Kutta, Supplementary Variable Technique, MATLAB, MTBF

Full Text